Angewandte Mathematik Und Informatik Universit at Zu K Oln Simplicity and Hardness of the Maximum Traveling Salesman Problem under Geometric Distances

Angewandte Mathematik Und Informatik Universit at Zu K Oln

Angewandte Mathematik Und Informatik Universit at Zu K Oln Relaxations of the Max Cut Problem and Computation of Spin Glass Ground States Relaxations of the Max Cut Problem and Computation of Spin Glass Ground States

Angewandte Mathematik Und Informatik Universit at Zu K Oln Parallel Turbulence Simulation Based on Mpi

Angewandte Mathematik Und Informatik Universit at Zu K Oln Traveling the Boundary of Minkowski Sums Ss Andor P.fekete Center for Parallel Computing Universitt at Zu Kk Oln D{50923 Kk Oln Germany

We consider the problem of traveling the contour of the set of all points that are within distance 1 of a connected planar curve arrangement P, forming an embedding of the graph G. We show that if the overall length of P is L, there is a closed roundtrip that visits all points of the contour and has length no longer than 2L + 2. This result carries over in a more general setting: if R is a comp...

Angewandte Mathematik Und Informatik Universit at Zu K Oln Basic Design Ideas for the Branch-and-cut-system Abacus